Romankov V. A. «Diophantine cryptography over innite groups» // 2012. №2(16) C.15-42
Rybalov A. N. «On generic complexity of the quadratic residuosity problem» // Applied Discrete Mathematics 2015. №2 (28) C.54-58
Rybalov A.N. «On generic complexity of the quadratic resi-duosity problem» // Applied Discrete Mathematics. Supplement 2015. №8 C.71-73
Rybalov A. N. «On generic complexity of the graph clustering problem» // Applied Discrete Mathematics 2019. №46 C.72-77
Rybalov Alexandr N. «On the generic complexity of solving equations over natural numbers with addition» // Applied Discrete Mathematics 2024. №64 C.72-78
Rybalov Alexandr N. «The generic complexity of the bounded problem of graphs clustering» // Applied Discrete Mathematics 2022. №57 C.91-97
Rybalov A. N. «On generic complexity of the discrete logarithm problem» // Applied Discrete Mathematics 2016. №3(33) C.93-97
Rybalov A. N. «On generic complexity of the problem of representation of natural numbers by sum of two squares» // Applied Discrete Mathematics 2020. №48 C.93-99
Rybalov A. N. «On generic complexity of the problem of finding roots in groups of residues» // Applied Discrete Mathematics 2017. №38 C.95-100
Rybalov A. N. «Generic complexity of the membership problem for semigroups of integer matrices» // Applied Discrete Mathematics 2022. №55 C.95-101
Rybalov A. N. «On generic complexity of decidability problem for diophantine systems in the Skolem's form» // Applied Discrete Mathematics 2017. №37 C.100-106
Rybalov A. N. «Relativized generic classes P and NP» // Applied Discrete Mathematics 2018. №40 C.100-104
Rybalov A. N. «On generic NP-completeness of the problem of Boolean circuits satisfiability» // Applied Discrete Mathematics 2020. №47 C.101-107
Rybalov Alexander N. «The generic complexity of the graph triangulation problem» // Applied Discrete Mathematics 2022. №58 C.105-111
Rybalov A. N. «On generic NP-completeness of the Boolean satisfiability problem» // Applied Discrete Mathematics 2017. №36 C.106-112
Rybalov A. N. «On generic undecidability of Hilbert's tenth problem for polynomial trees» // Applied Discrete Mathematics 2019. №44 C.107-112
Rybalov Alexander N. «Generically undecidable and hard problems» // Applied Discrete Mathematics 2024. №63 C.109-116
Rybalov Alexander N. «On the generic complexity of the problem of computing the Euler function» // Applied Discrete Mathematics 2024. №65 C.110-117
Lopatin Artem A., Rybalov Alexandr N. «On generic complexity of equation solving over the bicyclic monoid» // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics 2025. №67 C.110-117
Rybalov A.N. «On generic complexity of the problem to represent natural numbers by sum of two squares» // Applied Discrete Mathematics. Supplement 2020. №13 C.111-113
Rybalov A. N. «On generic complexity of the graph clustering problem with bounded clusters» // Applied Discrete Mathematics 2023. №60 C.114-119
Rybalov Alexandr N. «On the generic complexity of the discrete logarithm problem in Lucas sequences» // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics 2024. №66 C.116-122
Rybalov A. N. «On generic complexity of the subset sum problem for semigroups of integer matrices» // Applied Discrete Mathematics 2020. №50 C.118-126
Rybalov A. N. «On generic complexity of the validity problem for Boolean formulas» // Applied Discrete Mathematics 2016. №2(32) C.119-126
Rybalov Alexandr N. «On the generic complexity of the square root modulo prime problem» // Applied Discrete Mathematics 2023. №62 C.119-123
Rybalov A. N. «On generic complexity of the existential theories» // Applied Discrete Mathematics 2020. №49 C.120-126
Rybalov A. N. «On generic complexity of the isomorphism problem for finite semigroups» // Applied Discrete Mathematics 2021. №51 C.120-128
Rybalov A. N. «The general complexity of the problem to recognize Hamiltonian paths» // Applied Discrete Mathematics 2021. №53 C.120-126
Rybalov Alexander N. «On generic complexity of the integer factorization problem» // Applied Discrete Mathematics 2023. №61 C.121-126
Rybalov A.N. «On the generic complexity of discrete logarithm problem in groups of elliptic curves over finite fields» // Applied Discrete Mathematics. Supplement 2018. №11 C.133-136
Rybalov A. N. «On generic complexity of the isomorphism problem for finite semigroups» // Applied Discrete Mathematics. Supplement 2021. №14 C.178-180
Rybalov A.N. «On the generic complexity of the decoding problem for linear codes» // Applied Discrete Mathematics. Supplement 2019. №12 C.198-202